Matching Feature Points in Stereo Pairs: A Comparative Study of Some Matching Strategies Etienne Vincent and Robert Lagani`ere School of Information Technology and Engineering University of Ottawa

Source URL: www.site.uottawa.ca

• Vision
• Optics
• Epipolar geometry
• Corner detection
• Correlation and dependence
• Fundamental matrix
• Symmetry
• Correspondence problem
• Computer vision
• Image processing
• Imaging

Department of Epidemiology School of Public Health University of California, Los Angeles GRADING -- PROBLEM ONE Maximum Missing Points

Source URL: www.ph.ucla.edu

Open Problem: Determine the ideal defining Sec4 (P3 × P3 × P3 ). (Here Sec4 (V ) means the closure of the union of 3-dimensional secant spaces determined by 4 points on V .) Reward: At the IMA workshop in March 2007, I

Source URL: www.dms.uaf.edu

• P3
• Proj construction
• Quintic function
• Mathematics
• Scheme theory
• Polynomials
• Honda P series

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 A Lower Bound on the Area of a 3-Coloured Disc Packing Peter Brass∗ Ferran Hurtado†

Source URL: cccg.ca

• Discrete geometry
• Computational geometry
• Lattice points
• Order theory
• Diagrams
• Voronoi diagram
• Lattice
• Total order
• Packing problem
• Mathematics
• Geometry
• Abstract algebra

Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set

Source URL: www.cccg.ca

• Mathematical optimization
• Computational geometry
• Dynamic programming
• Equations
• Systems engineering
• Algorithm
• Travelling salesman problem
• Convex hull
• Kirkpatrick–Seidel algorithm
• Operations research
• Mathematics
• Applied mathematics

(I) BejaThis problem was worth five points. The scoring rubric below includes 13 points. After the papers were scored, each score was multiplied by 5/13 so that each score was in the range of 0 to 5 points. Transl

Source URL: www.naclo.cs.cmu.edu

• Linguistic morphology
• Accusative case
• Gunwinyguan languages
• Tigrinya grammar
• ʾIʿrab
• Linguistics
• Grammar
• Language

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Source URL: cccg.ca

• Spanning tree
• Network theory
• Shortest path problem
• Minimum spanning tree
• Theoretical computer science
• Graph theory
• Mathematics

Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and

Source URL: www.ics.uci.edu

• Analysis of algorithms
• Computational geometry
• Probabilistic complexity theory
• Randomized algorithm
• Algorithm
• Time complexity
• Binary search algorithm
• LP-type problem
• Closest pair of points problem
• Theoretical computer science
• Applied mathematics
• Mathematics

Dueling algorithms ∗ Nicole Immorlica Adam Tauman Kalai Brendan Lucier

Source URL: www.ssc.upenn.edu

• Game theory
• Fixed points
• Search algorithms
• Secretary problem
• Probability space
• Minimax
• Selection algorithm
• Mathematical optimization
• Price of anarchy
• Mathematics
• Algebra
• Decision theory

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan†

Source URL: cccg.ca

• Bin
• Fractional cascading
• Closest pair of points problem
• R-tree
• FO
• Voronoi diagram
• Discrete mathematics
• Mathematics
• Geometry
• Computational geometry